#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <utility>
using namespace std;

#define mm(a, n) memset(a, n, sizeof a)
#define mk(a, b) make_pair(a, b)

const double eps = 1e-6;
const int INF = 0x3f3f3f3f;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef pair<LL, LL> PLL;
typedef pair<int, LL> PIL;

inline void quickread() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}



inline void solution() {
    int a, b, c, m;
	
	cin >> a >> b >> c >> m;

    if (a > c) swap(a, c);
	if (b > c) swap(b, c);
	if (a > b) swap(a, b);// 使得c>b>a，方便后面算minn
	
	int maxx = a + b + c - 3 ;
	int minn = c - b - a - 1 ;
	
	if (m > maxx || m < minn) cout << "NO\n";
	else cout << "YES\n";
}

int main() {
    // freopen("input.txt", "r", stdin);
    quickread();
    int T;
    cin >> T;
    while (T -- ) {
       solution();
    }
    return 0;
}